Introduction to Fast Multipole Methods
نویسنده
چکیده
This is a simple introduction to fast multipole methods for the N-body summation problems. Low rank approximation plus hierarchical decomposition leads to fast O(N) or O(N logN) algorithms for the summation problem or equivalently the computation of a matrix-vector product. Code for 1-D problem is presented for a better illustration. We consider a summation problem in the form:
منابع مشابه
A Comparative Study of Multipole and Empirical Relations Methods for Effective Index and Dispersion Calculations of Silica-Based Photonic Crystal Fibers
In this paper, we present a solid-core Silica-based photonic crystal fiber (PCF) composed of hexagonal lattice of air-holes and calculate the effective index and chromatic dispersion of PCF for different physical parameters using the empirical relations method (ERM). These results are compared with the data obtained from the conventional multipole method (MPM). Our simulation results reveal tha...
متن کاملFast Algorithms for Boundary Integral Equations
This article reviews several fast algorithms for boundary integral equations. After a brief introduction of the boundary integral equations for the Laplace and Helmholtz equations, we discuss in order the fast multipole method and its kernel independent variant, the hierarchical matrix framework, the wavelet based method, the high frequency fast multipole method, and the recently proposed multi...
متن کاملToward Fast Multipole Methods on a Lattice
We discuss the concept and implementation of fast multipole algorithms on a regular structured grid. In doing so, the discrte analogue of the continuous fundamental solution is evaluated numerically. We discuss the concept and implementation of fast multipole algorithms on a regular structured grid. In doing so, the discrte analogue of the continuous fundamental solution is evaluated numericall...
متن کاملThe fast multipole boundary element method for potential problems: A tutorial
The fast multipole method (FMM) has been regarded as one of the top 10 algorithms in scientific computing that were developed in the 20th century. Combined with the FMM, the boundary element method (BEM) can now solve large-scale problems with several million degrees of freedom on a desktop computer within hours. This opened up a wide range of applications for the BEM that has been hindered for...
متن کاملCommunication Complexity of the Fast Multipole Method and its Algebraic Variants
A combination of hierarchical tree-like data structures and data access patterns from fast multipole methods and hierarchical low-rank approximation of linear operators from H-matrix methods appears to form an algorithmic path forward for efficient implementation of many linear algebraic operations of scientific computing at the exascale. The combination provides asymptotically optimal computat...
متن کامل